Edge computing-based real-time scheduling for digital twin flexible job shop with variable time window
نویسندگان
چکیده
• A new R-DTFJSS idea was developed to realise high-efficiency production. Edge computing-based framework can enhance the data processing ability. variable time window-based RS strategy used achieve operation allocation. An IHA-based solve method designed reduce computational complexity. Production scheduling is central link between enterprise production and management also key realising efficient, high-quality sustainable However, in real-world manufacturing, frequent occurrence of abnormal disturbance leads deviation scheduling, which affects accuracy reliability execution. The traditional dynamic methods (TDSMs) cannot this problem effectively. This paper presents a real-time digital twin flexible job shop (R-DTFJSS) with edge computing address issue. Firstly, an overall proposed (RS) through interaction physical workshop (PW) virtual (VW). Secondly, implementation process Then, obtain optimal result, improved Hungarian algorithm (IHA) adopted. Finally, case simulation from industrial cooperative described analysed verify effectiveness method. results show that compared TDSMs, effectively deal unexpected disturbances process.
منابع مشابه
Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints
This paper deals with the cyclic scheduling of flexible job-shop with time window constraints and resource capacity constraints. For time window constraints, the duration for processing products on machines and the duration for translating products from one machine to another by transfers are taken into account; for the resource capacity constraints, the confined operation space of machines and...
متن کاملFlexible job-shop scheduling with parallel variable neighborhood search algorithm
Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. This paper proposes a parallel variable neighborhood search (PVNS)...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics and Computer-integrated Manufacturing
سال: 2023
ISSN: ['1879-2537', '0736-5845']
DOI: https://doi.org/10.1016/j.rcim.2022.102435